Sequence Independent Lifting for Mixed-Integer Programming

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequence Independent Lifting for Mixed-Integer Programming

Lifting is a procedure for deriving strong valid inequalities for a closed set from inequalities that are valid for its lower dimensional restrictions. It is arguably one of the most effective ways of strengthening linear programming relaxations of 0–1 programming problems. Wolsey (1977) and Gu et al. (2000) show that superadditive lifting functions lead to sequence independent lifting of valid...

متن کامل

Sequence Independent Lifting in Mixed Integer Programming

We investigate lifting i e the process of taking a valid inequality for a polyhe dron and extending it to a valid inequality in a higher dimensional space Lifting is usually applied sequentially that is variables in a set are lifted one after the other This may be computationally unattractive since it involves the solution of an optimization problem to compute a lifting coe cient for each varia...

متن کامل

Lifting for conic mixed-integer programming

Lifting is a procedure for deriving valid inequalities formixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very effective in developing strong valid inequalities for linear integer programming and it has been successfully used to solve such problems with branch-and-cut algorithms. Here we generalize the theory of lifting to conic i...

متن کامل

Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds

We investigate the convex hull of the set defined by a single inequality with continuous and binary variables with variable upper bound constraints. We extend the traditional flow cover inequality, and show that it is valid for a restriction of the set in which some variables are fixed. We also give conditions under which this inequality is facet-defining and, when it is not, we show how it can...

متن کامل

ALTERNATIVE MIXED INTEGER PROGRAMMING FOR FINDING EFFICIENT BCC UNIT

Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 2004

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.1030.0099